A Framework for Programming Using Non-Atomic Variables

نویسنده

  • Ambuj K. Singh
چکیده

27 alized data race free program runs on alpha consistent memories as if they were sequentially consistent. We present a general method for transforming a non-cooperative mutual exclusion algorithm based on sequential consistency into an algorithm based on alpha consistency. We also show that for two well-known mutual exclusion algorithms, a speciic analysis of the code provides a more eecient algorithm. Gharachorloo, Horning, Saxe, Sites and Yu are currently working on further formalization of the Alpha memory model 18]. Given such a formalization it would be interesting to verify that it is indeed captured by alpha consistency. An important question left open by our work is how to transform programs written for sequentially consistent memories to work under alpha consistency with minimum amount of synchronization, i.e., using a minimal number of MB operations. Since this problem is probably quite hard, it might be more realistic to concentrate on methods that approximate this goal. The PowerPC is another new microprocessor architecture which includes a speciication of the shared memory model for PowerPC based multiprocessors. A formal deenition of this model using axioms appears in 12], where it is shown that if all accesses to shared data are protected by lock/unlock then a PowerPC based multiprocessor behaves as if it was sequentially consistent. A natural question is whether this result holds for any kind of release and acquire sequences. It is also interesting to check whether there is a simple way of transforming mutual exclusion algorithms based on sequential consistency to PowerPC based multiprocessors. Acknowledgements: Marc Snir suggested the Alpha as a test case for our framework; this paper would have never been written if it was not for his suggestion. We would like to thank Kourosh Gharachorloo, Maurice Herlihy and Burkhard Neidecker-Lutz for helping us understand the Alpha memory model. Thanks also to Jennifer Welch and Bill Weihl for helpful comments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Waveform Design using Second Order Cone Programming in Radar Systems

Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...

متن کامل

A Fuzzy Goal Programming Approach for Optimizing Non-normal Fuzzy Multiple Response Problems

In most manufacturing processes, each product may contain a variety of quality characteristics which are of the interest to be optimized simultaneously through determination of the optimum setting of controllable factors. Although, classic experimental design presents some solutions for this regard, in a fuzzy environment, and in cases where the response data follow non-normal distributions, th...

متن کامل

An iterative method for tri-level quadratic fractional programming problems using fuzzy goal programming approach

Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of pro...

متن کامل

Well-dispersed subsets of non-dominated solutions for MOMILP ‎problem

This paper uses the weighted L$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. When all variables are integer it finds the whole set of efficient solutions. In each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...

متن کامل

SOME PROPERTIES FOR FUZZY CHANCE CONSTRAINED PROGRAMMING

Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...

متن کامل

Defuzzification Method for Solving ‎Fuzzy ‎Linear Programming Problems

Several authors have proposed different methods to find the solution of fully fuzzy linear programming (FFLP) problems. But all the existing methods are based on the assumption that all the fuzzy coefficients and the fuzzy variables are non-negative fuzzy numbers. in this paper a new method is proposed to solve an FFLP problems with arbitrary fuzzy coefficients and arbitrary fuzzy variables, th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994